Circumference, chromatic number and online coloring
نویسندگان
چکیده
منابع مشابه
Circumference, Chromatic Number and Online Coloring
Erdös conjectured that if G is a triangle free graph of chromatic number at least k ≥ 3, then it contains an odd cycle of length at least k2−o(1) [12, 14]. Nothing better than a linear bound ([3], Problem 5.1.55 in [15]) was so far known. We make progress on this conjecture by showing that G contains an odd cycle of length at least O(k log log k). Erdös’ conjecture is known to hold for graphs w...
متن کاملArc-coloring of directed hypergraphs and chromatic number of walls
We define an arc-coloring for directed hypergraphs, such that any two arcs having either intersecting tails or the same head must be colored differently. We investigate the arc-coloring of those hypergraphs which can be represented by suitable adjacency matrices (walls), whereas a polynomial reduction is provided from the general arc-coloring problem to the brick-coloring of walls. An upper bou...
متن کاملOn coloring graphs with locally small chromatic number
In 1973, P. Erd6s conjectured tha t for each k ~ 2 , there exists a cons tan t ck so that if G is a g raph on n vertices and G has no odd cycle with length less than ckn ~/k, then the chromat ic n u m b e r o f G is at mos t k + 1. Cons t ruc t ions due to LovAsz and Schriver show that ck, if it exists, mus t be at least 1. In this paper we settle Erd6s ' conjecture in the affirmative. We actua...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملPacking chromatic number versus chromatic and clique number
The packing chromatic number χρ(G) of a graphG is the smallest integer k such that the vertex set of G can be partitioned into sets Vi, i ∈ [k], where each Vi is an i-packing. In this paper, we investigate for a given triple (a, b, c) of positive integers whether there exists a graph G such that ω(G) = a, χ(G) = b, and χρ(G) = c. If so, we say that (a, b, c) is realizable. It is proved that b =...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2013
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-013-2542-9